SplayNet: Towards Locally Self-Adjusting Networks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Concurrent self-adjusting distributed tree networks

SplayNets are a distributed generalization of the classic splay tree data structures. Given a set of communication requests and a network comprised of n nodes, such that any pair of nodes is capable of establishing a direct connection, the goal is to dynamically find a (locally routable) binary tree topology, which connects all nodes and optimizes the routing cost for that communication pattern...

متن کامل

Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures

This paper initiates the study of self-adjusting distributed data structures for networks. In particular, we present SplayNets: a binary search tree based network that is self-adjusting to routing request. We derive entropy bounds on the amortized routing cost and show that our splaying algorithm has some interesting properties. 1 Contribution Sketch Distributed Splay Trees. In the mid 80s, Sle...

متن کامل

Towards Community Detection in Locally Heterogeneous Networks

In recent years, the size of many social networks such as Facebook, MySpace, and LinkedIn has exploded at a rapid pace, because of its convenience in using the internet in order to connect geographically disparate users. This has lead to considerable interest in many graph-theoretical aspects of social networks such as the underlying communities, the graph diameter, and other structural informa...

متن کامل

Towards Self-Configuring Networks

Current networks require ad-hoc operating procedures by expert administrators to handle changes. These configuration management operations are costly and error prone. Active networks[2, 3] involve particularly fast dynamics of change that cannot depend on operators and must be automated. This paper describes an architecture called NESTOR that seeks to replace labor-intensive configuration manag...

متن کامل

Towards Self-Explaining Networks

In this paper, we argue that networks should be able to explain to their operators why they are in a certain state, even if – and particularly if – they have been compromised by an attacker. Such a capability would be useful in forensic investigations, where an operator observes an unexpected state and must decide whether it is benign or an indication that the system has been compromised. Using...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE/ACM Transactions on Networking

سال: 2016

ISSN: 1063-6692,1558-2566

DOI: 10.1109/tnet.2015.2410313